Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar

نویسندگان

  • Akio Fujiyoshi
  • Masakazu Suzuki
  • Seiichi Uchida
چکیده

This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR system. Like a C compiler detecting syntax errors in a source file, we want to have a verification mechanism to find errors in the output of mathematical OCR. Linear monadic context-free tree grammar (LM-CFTG) was employed as a formal framework to define “well-formed” mathematical formulae. For the purpose of practical evaluation, a verification system for mathematical OCR was developed, and the effectiveness of the system was demonstrated by using the ground-truthed mathematical document database INFTY CDB-1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structural Analysis of Mathematical Formulae with Verification Based on Formula Description Grammar

In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps. In the first step, a fast structural analysis algorithm is performed on each mathematical formula to obtain a tree representation of the formula. This step generally provides a correct tree representation but someti...

متن کامل

Studying impressive parameters on the performance of Persian probabilistic context free grammar parser

In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...

متن کامل

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

Contextualizing Grammar Instruction through Meaning-Centered Planned Pre-emptive Treatment and Enhanced Input in an EFL Context

This study has aimed to compare the effects of two types of form-focused instruction, i.e. de-contextualized focus-on-forms instruction versus meaning-centered contextualized focus-on-form instruction, on the development of grammatical knowledge of Iranian high-school students. Two groups of male high-school first graders participated in this study.  One group was taught through de-contextualiz...

متن کامل

The effects of Curriculum-Based Measurement on EFL learners' achievements in grammar and reading

The purpose of this study was to examine the effect of using Curriculum-Based Measurement (CBM) on the learners’ achievement in L2 grammar and reading in an EFL context and to further  investigate  whether  the  students’  classroom  performances  would  predict  their  final exam  results.  To  conduct  this  study,  two  classes,  each  containing  30  female  students,  were selected  among ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008